Algorithms for Drawing Graphs: an Annotated Bibliography

نویسندگان

  • Giuseppe Di Battista
  • Peter Eades
  • Roberto Tamassia
  • Ioannis G. Tollis
چکیده

Several data presentation problems involve drawing graphs so that they are easy to read and understand. Examples include circuit schematics and software engineering diagrams. In this paper we present a bibliographic survey on algorithms whose goal is to produce aesthetically pleasing drawings of graphs. Research on this topic is spread over the broad spectrum of Computer Science. This bibliography constitutes an attempt to encompass both theoretical and application oriented papers from disparate areas. ∗This document is available via anonymous ftp from wilma.cs.brown.edu (128.148.19.15), files /pub/papers/compgeo/gdbiblio.tex.Z and /pub/papers/compgeo/gdbiblio.ps.Z.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic Shortest Paths and Transitive Closure: an Annotated Bibliography (Draft)

This is an annotated bibliography on fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and dynamic shortest paths. Although research on these problems spans over more than three decades, in the last couple of years many novel algorithmic techniques have been proposed. 1 Dynamic Path Problems A d...

متن کامل

An annotated bibliography on 1-planarity

The notion of 1-planarity is among the most natural and most studied generalizations of graph planarity. A graph is 1-planar if it has an embedding where each edge is crossed by at most another edge. The study of 1-planar graphs dates back to more than fifty years ago and, recently, it has driven increasing attention in the areas of graph theory, graph algorithms, graph drawing, and computation...

متن کامل

META-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS

The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...

متن کامل

A New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity

Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...

متن کامل

Graphite: A Suite of Hygraph Visualization Utilities

This document provides a high level overview of the functionality realized by a set of C++ programs that comprise the graphite utilities. The current package supports general and directed graphs and hygraphs (a nested graph formalism) and includes programs that: draw graphs, generate several types of fisheye views and other visual abstractions, convert graphs between several external formats, a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Comput. Geom.

دوره 4  شماره 

صفحات  -

تاریخ انتشار 1994